GraphSLAM Improved by Removing Measurement Outliers
نویسندگان
چکیده
منابع مشابه
Robustifying Eeg Data Analysis by Removing Outliers
Biomedical signals such as EEG are typically contaminated by measurement artifacts, outliers and non-standard noise sources. We propose to use techniques from robust statistics and machine learning to reduce the influence of such distortions. Two showcase application scenarios are studied: (a) Lateralized Readiness Potential (LRP) analysis, where we show that a robust treatment of the EEG allow...
متن کاملRemoving Outliers in Illumination Estimation
A method of outlier detection is proposed as a way of improving illumination-estimation performance in general, and for scenes with multiple sources of illumination in particular. Based on random sample consensus (RANSAC), the proposed method (i) makes estimates of the illumination chromaticity from multiple, randomly sampled sub-images of the input image; (ii) fits a model to the estimates; (i...
متن کاملImproving kNN Text Categorization by Removing Outliers from Training Set
We show that excluding outliers from the training data significantly improves kNN classifier, which in this case performs about 10% better than the best know method—Centroid-based classifier. Outliers are the elements whose similarity to the centroid of the corresponding category is below a threshold.
متن کاملRemoving outliers by minimizing the sum of infeasibilities
This paper shows that we can classify latent outliers efficiently through the process of minimizing the sum of infeasibilities (SOI). The SOI minimization has been developed in the area of convex optimization to find an initial solution, solve a feasibility problem, or check out some inconsistent constraints. It was also adopted recently as an approximation method to minimize a robust error fun...
متن کاملRemoving Outliers to Minimize Area and Perimeter
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O ( n (( 4c 2c ) (3c) + log n )) time algorithm that solves this problem when “smallest” is taken to mean least area or least perimeter.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2011
ISSN: 1976-9172
DOI: 10.5391/jkiis.2011.21.4.493